Semantics matters: cognitively plausible delineation of city centres from point of interest data

We sketch a workflow for cognitively plausible recognition of vague geographical concepts, such as a city centre. Our approach imitates a pedestrian strolling through the streets, and comparing his/her internal cognitive model of a city centre with the stimulus from the external world to decide whether he/she is in the city centre or outside. The cognitive model of a British city centre is elicited through an online questionnaire survey and used to delineate referents of city centre from point of interest data. We first compute a measure of ‘city centre-ness’ at each location within a city, and then merge the area of high city centre-ness to a contiguous region. The process is illustrated on the example of the City of Bristol, and the computed city centre area for Bristol is evaluated by comparison to reference areas derived from alternative sources. The evaluation suggests that our approach performs well and produces a representation of a city centre that is near to people’s conceptualisation. The benefits of our work are better (and user-driven) descriptions of complex geographical concepts. We see such models as a prerequisite for generalisation over large changes in detail, and for very specific purposes

Road network selection for small-scale maps using an improved centrality-based algorithm

The road network is one of the key feature classes in topographic maps and databases. In the task of deriving road networks for products at smaller scales, road network selection forms a prerequisite for all other generalization operators, and is thus a fundamental operation in the overall process of topographic map and database production. The objective of this work was to develop an algorithm for automated road network selection from a large-scale (1:10,000) to a small-scale database (1:200,000). The project was pursued in collaboration with swisstopo, the national mapping agency of Switzerland, with generic mapping requirements in mind. Preliminary experiments suggested that a selection algorithm based on betweenness centrality performed best for this purpose, yet also exposed problems. The main contribution of this paper thus consists of four extensions that address deficiencies of the basic centrality-based algorithm and lead to a significant improvement of the results. The first two extensions improve the formation of strokes concatenating the road segments, which is crucial since strokes provide the foundation upon which the network centrality measure is computed. Thus, the first extension ensures that roundabouts are detected and collapsed, thus avoiding interruptions of strokes by roundabouts, while the second introduces additional semantics in the process of stroke formation, allowing longer and more plausible strokes to built. The third extension detects areas of high road density (i.e., urban areas) using density-based clustering and then locally increases the threshold of the centrality measure used to select road segments, such that more thinning takes place in those areas. Finally, since the basic algorithm tends to create dead-ends—which however are not tolerated in small-scale maps—the fourth extension reconnects these dead-ends to the main network, searching for the best path in the main heading of the dead-end

Unstable Adams operations on p-local compact groups

A p-local compact group is an algebraic object modelled on the p-local homotopy theory of classifying spaces of compact Lie groups and p-compact groups. In the study of these objects unstable Adams operations, are of fundamental importance. In this paper we define unstable Adams operations within the theory of p-local compact groups, and show that such operations exist under rather mild conditions. More precisely, we prove that for a given p-local compact group G and a sufficiently large positive integer $m$, there exists an injective group homomorphism from the group of p-adic units which are congruent to 1 modulo p^m to the group of unstable Adams operations on

A Multi-parameter Approach to Automated Building Grouping and Generalization

This paper presents an approach to automated building grouping and generalization. Three principles of Gestalt theories, i.e. proximity, similarity, and common directions, are employed as guidelines, and six parameters, i.e. minimum distance, area of visible scope, area ratio, edge number ratio, smallest minimum bounding rectangle (SMBR), directional Voronoi diagram (DVD), are selected to describe spatial patterns, distributions and relations of buildings. Based on these principles and parameters, an approach to building grouping and generalization is developed. First, buildings are triangulated based on Delaunay triangulation rules, by which topological adjacency relations between buildings are obtained and the six parameters are calculated and recorded. Every two topologically adjacent buildings form a potential group. Three criteria from previous experience and Gestalt principles are employed to tell whether a 2-building group is ‘strong,' ‘average' or ‘weak.' The ‘weak' groups are deleted from the group array. Secondly, the retained groups with common buildings are organized to form intermediate groups according to their relations. After this step, the intermediate groups with common buildings are aggregated or separated and the final groups are formed. Finally, appropriate operators/algorithms are selected for each group and the generalized buildings are achieved. This approach is fully automatic. As our experiments show, it can be used primarily in the generalization of buildings arranged in block

08451 Abstracts Collection -- Representation, Analysis and Visualization of Moving Objects

From 02.11. to 07.11.2008, the Dagstuhl Seminar 08451 ``Representation, Analysis and Visualization of Moving Objects \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Trajectory similarity analysis in movement parameter space

This paper introduces a similarity analysis method for moving object trajectories. The proposed method assesses the similarity between a set of trajectories in a multidimensional space, whose dimensions are formed by different movement parameters (e.g. position, speed, acceleration, direction), plus time. We investigate the applicability of the proposed method in finding relative movement patterns such as coincidence and concurrence in the movement of North Atlantic hurricanes

Automated processing for map generalization using web services

In map generalization various operators are applied to the features of a map in order to maintain and improve the legibility of the map after the scale has been changed. These operators must be applied in the proper sequence and the quality of the results must be continuously evaluated. Cartographic constraints can be used to define the conditions that have to be met in order to make a map legible and compliant to the user needs. The combinatorial optimization approaches shown in this paper use cartographic constraints to control and restrict the selection and application of a variety of different independent generalization operators into an optimal sequence. Different optimization techniques including hill climbing, simulated annealing and genetic deep search are presented and evaluated experimentally by the example of the generalization of buildings in blocks. All algorithms used in this paper have been implemented in a web services framework. This allows the use of distributed and parallel processing in order to speed up the search for optimized generalization operator sequence

Parameter-free aggregation of value functions from multiple experts and uncertainty assessment in multi-criteria evaluation

This paper makes a threefold contribution to spatial multi-criteria evaluation (MCE): firstly by presenting a new method concerning value functions, secondly by comparing different approaches to assess the uncertainty of a MCE outcome, and thirdly by presenting a case-study on land-use change. Even though MCE is a well-known methodology in GIScience, there is a lack of practicable approaches to incorporate the potentially diverse views of multiple experts in defining and standardizing the values used to implement input criteria. We propose a new method that allows generating and aggregating non-monotonic value functions, integrating the views of multiple experts. The new approach only requires the experts to provide up to four values, making it easy to be included in questionnaires. We applied the proposed method in a case study that uses MCE to assess the potential of future loss of vineyards in a wine-growing area in Switzerland, involving 13 experts from research, consultancy, government, and practice. To assess the uncertainty of the outcome three different approaches were used: firstly, a complete Monte Carlo simulation with the bootstrapped inputs, secondly a one-factor-at-a-time variation, and thirdly bootstrapping of the 13 inputs with subsequent analytical error propagation. The complete Monte Carlo simulation has shown the most detailed distribution of the uncertainty. However, all three methods indicate a general trend of areas with lower likelihood of future cultivation to show a higher degree of relative uncertainty

Variable-resolution Compression of Vector Data

The compression of spatial data is a promising solution to reduce the space of data storage and to decrease the transmission time of spatial data over the Internet. This paper proposes a new method for variable-resolution compression of vector data. Three key steps are encompassed in the proposed method, namely, the simplification of vector data via the elimination of vertices, the compression of removed vertices, and the decoding of the compressed vector data. The proposed compression method was implemented and applied to compress vector data to investigate its performance in terms of the compression ratio, distortions of geometric shapes. The results show that the proposed method provides a feasible and efficient solution for the compression of vector data, is able to achieve good compression ratios and maintains the main shape characteristics of the spatial objects within the compressed vector dat